A decomposition approximation for the analysis of voice/data integration

AbsmcfA closed-form decomposition approximation for finding the data performance in voicddata queuing systems is presented. The approximation is based on Courtois’ decompositiodaggregation techniques and is applied to Senet hybrid multiplexing, movable boundary frame allocation schemes. The approximation is applied to both infinite and finite buffer systems. In the former case the approximation is valid only in the underload region and serves as an upperbound for the mean data queuing delay. In the finite buffer case it is valid for the whole data tramc range and is shown to improve as the number of channels increase, and deteriorates as the buffer size increases. For finite buffer systems upper and lower hounds for the decomposition approximation have also been derived. It is found that the lower bound is tight in the underload and low traffk region of the overload. In these same regions the decomposition approximation serves as a tight upperbound.